Verifying Secrecy by Abstract Interpretation
نویسندگان
چکیده
منابع مشابه
Pattern - based Abstraction for Verifying Secrecy in Protocols 1
We present a method based on abstract interpretation for verifying secrecy properties of cryptographic protocols. Our method allows to verify secrecy properties in a general model allowing an unbounded number of sessions, an unbounded number of principals and an unbounded size of messages. As abstract domain we use sets of so-called super terms. Super terms are obtained by allowing an interpret...
متن کاملUniversité Du Québec En Outaouais Formal Methods for Security Protocol Correctness Thesis Submited in Partial Fulfillment of the Requirements for the Degree of Master of Science By
The goal of this thesis is to explore the use of formal methods for security protocol correctness. Nowadays, one of the core research directions in a constantly growing distributed environment is the improvement of the security aspects of the communication process. Security flaws have been discovered in quite a few occasions, in spite of the considerable amount of time and effort required for t...
متن کاملConstraint-Based Abstraction of a Model Checker for Infinite State Systems
Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techni...
متن کاملTechnical Report: Computationally Sound Secrecy Proofs by Mechanized Flow Analysis
We present a novel approach for proving secrecy properties of security protocols by mechanized flow analysis. In contrast to existing tools for proving secrecy by abstract interpretation, our tool enjoys cryptographic soundness in the strong sense of blackbox reactive simulatability/UC which entails that secrecy properties proven by our tool are automatically guaranteed to hold for secure crypt...
متن کاملA Practical Logic Framework for Verifying Safety Properties of Executables
We present a novel program logic, Lf , which is designed on top of a Hoare logic, but is simpler, more flexible and more scalable. Based on Lf , we develop a framework for automatically verifying safety properties of executables. It utilizes a whole-program interprocedural abstract interpretation to automatically discover the specifications needed by Lf to prove a program judgment. We implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002